Evaluating SPARQL 1.1 Property Path Support
نویسندگان
چکیده
With the release of SPARQL 1.1 in 2013 property paths were introduced, which make it possible to describe queries that do not explicitly define the length of the path that is traversed within an RDF graph. Already existing RDF stores were adapted to support property paths. In order to give an insight on how well the current implementations of property paths in RDF stores work, we introduce a benchmark for evaluating the support of property paths. In order to support realistic RDF graphs as well as arbitrarily scalable synthetic RDF graphs as benchmark dataset, a query generator was developed that creates queries from query templates. Furthermore, we present the results of our benchmark for 4 RDF stores frequently used in academia and industry. These results indicate that many current implementations of property paths have several shortcomings.
منابع مشابه
WAVEGUIDE: Evaluating SPARQL Property Path Queries
The extension of SPARQL 1.1 of property paths now o↵ers a type of regular path query for RDF graph databases. While eminently useful, these queries are di cult to optimize to evaluate e ciently. We have embarked on a project we call Waveguide to build a cost-based optimizer for SPARQL queries with property paths. Waveguidemaps the property path to a waveguide plan (WGP) composed of wavefront au...
متن کاملOn the Primitivity of SPARQL 1.1 Operators
The paper studies the primitivity of the eleven basic operators used in the SPARQL 1.1 query language. This paper shows that the six operators BIND, FILTER, GRAPH, property path, SELECT, and VALUES are primitive while the left five operators AND, EXISTS, MINUS, OPT, and UNION, are not primitive. It is surprised that OPT and UNION which are primitive in SPARQL 1.0 become no longer primitive in S...
متن کاملPath discovery by Querying the federation of Relational Database and RDF Graph
The class of queries for detecting path is an important as those can extract implicit binary relations over the nodes of input graphs. Most of the path querying languages used by the RDF community, like property paths in W3C SPARQL 1.1 and nested regular expressions in nSPARQL are based on the regular expressions. Federated queries allow for combining graph patterns and relational database that...
متن کاملTop-K Shortest Paths in Large Typed RDF Datasets Challenge
Perhaps the most widely appreciated linked data principle is the one that instructs linked data providers to provide useful information using the standards (i.e., RDF and SPARQL). Such information corresponds to patterns expressed as SPARQL queries that are matched against the RDF graph. Until recently, it was not possible to create a pattern without specifying the exact path that would match a...
متن کاملEvaluation of SPARQL Property Paths via Recursive SQL
Property paths, a part of the proposed SPARQL 1.1 standard, allow for non-trivial navigation in RDF graphs. We investigate the evaluation of SPARQL queries with property paths in a relational RDF store. We propose a translation of SPARQL property paths into recursive SQL and discuss possible optimization strategies.
متن کامل